Classical Distance-Regular Graphs of Negative Type
نویسنده
چکیده
Brouwer, Cohen, and Neumaier found that the intersection numbers of most known families of distance-regular graphs could be described in terms of four parameters (d, b, :, ;) [2, pp. ix, 193]. They invented the term classical to describe those graphs for which this could be done. All classical distance-regular graphs with b=1 are classified by Y. Egawa, A. Neumaier, and P. Terwilliger in a sequence of papers (see [2, p. 195] for a detailed description). In the present paper, we focus on the classical distance-regular graphs with b<&1. The following is our main result.
منابع مشابه
D-Spectrum and D-Energy of Complements of Iterated Line Graphs of Regular Graphs
The D-eigenvalues {µ1,…,µp} of a graph G are the eigenvalues of its distance matrix D and form its D-spectrum. The D-energy, ED(G) of G is given by ED (G) =∑i=1p |µi|. Two non cospectral graphs with respect to D are said to be D-equi energetic if they have the same D-energy. In this paper we show that if G is an r-regular graph on p vertices with 2r ≤ p - 1, then the complements of iterated lin...
متن کاملNordhaus-Gaddum type results for the Harary index of graphs
The emph{Harary index} $H(G)$ of a connected graph $G$ is defined as $H(G)=sum_{u,vin V(G)}frac{1}{d_G(u,v)}$ where $d_G(u,v)$ is the distance between vertices $u$ and $v$ of $G$. The Steiner distance in a graph, introduced by Chartrand et al. in 1989, is a natural generalization of the concept of classical graph distance. For a connected graph $G$ of order at least $2$ ...
متن کاملThe smallest eigenvalues of Hamming graphs, Johnson graphs and other distance-regular graphs with classical parameters
We prove a conjecture by Van Dam & Sotirov on the smallest eigenvalue of (distance-j) Hamming graphs and a conjecture by Karloff on the smallest eigenvalue of (distance-j) Johnson graphs. More generally, we study the smallest eigenvalue and the second largest eigenvalue in absolute value of the graphs of the relations of classical P and Q-polynomial association schemes.
متن کاملA new family of distance-regular graphs with unbounded diameter
We construct distance-regular graphs with the same classical parameters as the Grassmann graphs on the e-dimensional subspaces of a (2e+1)-dimensional space over an arbitrary finite field. This provides the first known family of non-transitive distance-regular graphs with unbounded diameter.
متن کاملVertex Subsets with Minimal Width and Dual Width in Q-Polynomial Distance-Regular Graphs
We study Q-polynomial distance-regular graphs from the point of view of what we call descendents, that is to say, those vertex subsets with the property that the width w and dual width w∗ satisfy w+w∗ = d, where d is the diameter of the graph. We show among other results that a nontrivial descendent with w > 2 is convex precisely when the graph has classical parameters. The classification of de...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Comb. Theory, Ser. B
دوره 76 شماره
صفحات -
تاریخ انتشار 1999